Unification as a Complexity Measure for Logic Programming
نویسندگان
چکیده
منابع مشابه
The Complexity of Equivariant Unification
Nominal logic is a first-order theory of names and binding based on a primitive operation of swapping rather than substitution. Urban, Pitts, and Gabbay have developed a nominal unification algorithm that unifies terms up to nominal equality. However, because of nominal logic’s equivariance principle, atomic formulas can be provably equivalent without being provably equal as terms, so resolutio...
متن کاملAvoiding Equivariance in Alpha-Prolog
αProlog is a logic programming language which is well-suited for rapid prototyping of type systems and operational semantics of typed λ-calculi and many other languages involving bound names. In αProlog, the nominal unification algorithm of Urban, Pitts and Gabbay is used instead of first-order unification. However, although αProlog can be viewed as Horn-clause logic programming in Pitts’ nomin...
متن کاملComplexity of Associative-commutative Unification Check and Related Problems *
The uniication problem for terms containing associative and commutative functions is of great importance in theorem provers based on term rewriting and resolution methods as well as in logic programming. The complexity of determining whether two such terms are uniiable was known to be NP-hard. It is proved that the problem is NP-complete by describing a nondeterministic polynomial time algorith...
متن کاملAn Integrated Distance for Atoms
In this work, we introduce a new distance function for data representations based on first-order logic (atoms, to be more precise) which integrates the main advantages of the distances that have been previously presented in the literature. Basically, our distance simultaneously takes into account some relevant aspects, concerning atom-based presentations, such as the position where the differen...
متن کاملUnification and Logarithmic Space
We present an algebraic characterization of the complexity classes Logspace and NLogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is inspired from proof theory and more specifically linear logic and Geometry of Interaction. We show how unification can be used to build a model of computation by means of specific su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Program.
دوره 4 شماره
صفحات -
تاریخ انتشار 1987